Stability of real-time lot-scheduling and machine replacement policies with quality levels

نویسندگان

  • Suresh P. Sethi
  • Gerhard Sorger
  • Xun Yu Zhou
چکیده

In this note we show how the main result of Lou et al. [2] can be generalized to an unreliable machine with various quality levels. We consider a single machine which can process parts of di erent types. The machine can process at most one part at a time and it needs a setup period whenever it switches from one part-type to another. Parts enter the system in type-speci c input rates and require type-speci c processing times. The quality of the machine deteriorates according to a continuous-time Markov process and the only way to improve the quality is by replacing the machine by a new one. We postulate a simple form of real-time replacement and scheduling policies, and derive conditions ensuring the stability of the system under these policies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ارزیابی سیاست‌های زمان‌بندی در نسل چهارم شبکه‌های سلولی (LTE)

New generation of wireless networks, LTE and WiMAX, supports many services which consume a lot of resources (such as VOIP, Video Conference, Digital Video, Multimedia streams and online Multi-player Games). Supporting multi-media services in wireless communication systems provide new resource allocation challenges. Because of high loads in downlink, efficient resource allocation is vital in dow...

متن کامل

Customer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

متن کامل

Optimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...

متن کامل

Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm

The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

متن کامل

A New model for integrated lot sizing and scheduling in flexible job shop problem

In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2000